The line graph of a directed graph G is a directed graph H such that the vertices of H are the edges of G and two vertices e and f of H are adjacent if e and f ...
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges ... Example · Properties · Iterating the line graph operator · Generalizations
In the mathematical field of graph theory, a path graph (or linear graph) is a graph whose vertices can be listed in the order v1, v2, ..., vn such that the ...
A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six Metelsky graphs as an induced subgraph (Metelsky and ...
This kind of graph is obtained by creating a vertex per edge in G and linking two vertices in H=L(G) if, and only if, the corresponding edges in G have an end ...
